The NW (Newman-Watts) small-world network and the BA (Barabasi-Albert) scale-free network are two kinds of common network in reality, these two kinds of networks have a highly possibility existing multiple paths between any pair of vertexes. If abandoning saturated augmented chain and finding augmented chain, the efficiency is not high. The fact above urged a high performance new algorithm described as minimum cut/maximum flow algorithm based on augmenting path restoration to manage these two networks. The new algorithm constantly sought vertexes following greedy heuristics to restore saturated augmenting paths which generated by adjusting flow on shortest paths. By experimental comparisons on the NW small-world network and the BA scale-free network, the new algorithm was several times faster than Ford-Fulkerson algorithm and half as Dinic algorithm in RAM usage, as a consequence, the new algorithm was capable of calculating growing telecommunication and traffic networks.